Routing Optimization Under Uncertainty

Routing Optimization Under Uncertainty

We consider a class of routing optimization problems under uncertainty in which all decisions are made before the uncertainty is realized. The objective is to obtain optimal routing solutions that would, as much as possible, adhere to a set of specified requirements after the uncertainty is realized. These problems include finding an optimal routing solution to meet the soft time window require...

Routing Optimization with Deadlines under Uncertainty

We consider a class of routing optimization problems on networks with deadlines imposed at a subset of nodes, and with uncertain arc travel times. The problems are static in the sense that routing decisions are made prior to the realization of uncertain travel times. The goal is to find optimal routing policies such that arrival times at nodes respect deadlines “as much as possible”. We propose...

Routing Optimization with Time Windows under Uncertainty

Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print ...

Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty

The desire for configuring well-managed OSPF routes to handle the communication needs in the contemporary business world with larger networks and changing service requirements has opened the way to use traffic engineering tools with the OSPF protocol. Moreover, anticipating possible shifts in expected traffic demands while using network resources efficiently has started to gain more attention. ...

Equilibrium routing under uncertainty